#include <bits/stdc++.h>
using namespace std;
int a[100005];
priority_queue <int,vector <int>,greater<int> > pq;
int main() {
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n; cin >> n;
    for(int i=1;i<=n;++i) cin >> a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;++i) {
        if(!pq.empty()) {
            if(a[i]>pq.top()) {
                pq.pop();
            }
        }
        pq.push(a[i]);
    }
    cout << pq.size();
    return 0;
}